A propositional linear time logic with time flow isomorphic to ω2
نویسندگان
چکیده
Primarily guided with the idea to express zero-time transitions by means of temporal propositional language, we have developed a temporal logic where the time flow is isomorphic to ordinal ω 2 (concatenation of ω copies of ω). If we think of ω 2 as lexicographically ordered ω×ω, then any particular zero-time transition can be represented by states whose indices are all elements of some {n} × ω. In order to express non-infinitesimal transitions, we have introduced a new unary temporal operator [ω] (ω-jump), whose effect on the time flow is the same as the effect of α → α + ω in ω 2. In terms of lexicographically ordered ω × ω, [ω]φ is satisfied in i, j-th time instant iff φ is satisfied in i + 1, 0-th time instant. Moreover, in order to formally capture the natural semantics of the until operator U, we have introduced a local variant u of the until operator. More precisely, φ uψ is satisfied in i, j-th time instant iff ψ is satisfied in i, j + k-th time instant for some nonnegative integer k, and φ is satisfied in i, j + l-th time instant for all 0 l < k. As in many of our previous publications, the leitmotif is the usage of infinitary inference rules in order to achieve the strong completeness.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملNatural Deduction Calculus for Quantified Propositional Linear-time Temporal Logic. Technical Report
We present a natural deduction calculus for the quantified propositional linear-time temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional linear-time temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the...
متن کاملPropositional Defeasible Logic has Linear Complexity
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.
متن کاملWeak Completeness Theorem for Propositional Linear Time Temporal Logic
We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every fo...
متن کاملComplexity of propositional Linear-time Temporal Logic with finitely many variables
We prove that model-checking and satisfiability problems for propositional Linear-time Temporal Logic with a single variable are PSPACE-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 12 شماره
صفحات -
تاریخ انتشار 2014